Fixed points with finite variance of a smoothing transformation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed Points of the Smoothing Transformation

Let W 1 ... . , W N be N nonnegative random variables and let 9J~ be the class of all probability measures on [0, m). Define a transformation T on 9J~ by letting T# be the distribution of W a X 1 + . . . + WNXN, where the X i are independent random variables with distribution /~, which are independent of W1, ..., W N as well. In earlier work, first Kahane and Peyriere, and then Holley and Ligge...

متن کامل

Fixed Points of the Min-Transformation

In this paper, the stochastic fixed-point equation X d = inf i≥1: Ti>0 Xi/Ti is studied, where d = means equality in law, (Xn)n≥1 and T = (Ti)i≥1 denote independent sequences of non-negative random variables, and X1,X2, ... are independent copies of the random variable X. Under suitable conditions on the given weight sequence T , most notably that 1 < EN < ∞ for N = ∑ i≥1 1{Ti>0} and that T has...

متن کامل

Fixed points of the smoothing transform; the boundary case

Let A = (A1, A2, A3, . . .) be a random sequence of non-negative numbers that are ultimately zero with E[ ∑ Ai] = 1 and E [ ∑ Ai log Ai] ≤ 0. The uniqueness of the non-negative fixed points of the associated smoothing transform is considered. These fixed points are solutions to the functional equation Φ(ψ) = E [ ∏ i Φ(ψAi)] , where Φ is the Laplace transform of a non-negative random variable. T...

متن کامل

A new approximation method for common fixed points of a finite family of nonexpansive non-self mappings in Banach spaces

In this paper, we introduce a new iterative scheme to approximate a common fixed point for a finite family of nonexpansive non-self mappings. Strong convergence theorems of the proposed iteration in Banach spaces.

متن کامل

Finding fixed points in finite lattices

Recently there has been much interest in the abstract interpretation of declarative languages. Abstract interpretation is a semantics-based approach to program analysis that uses compile time evaluation of programs using simplified value domains. This gives information about the run-time properties of programs and provides the basis for significant performance improvements. A particular example...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 2003

ISSN: 0304-4149

DOI: 10.1016/s0304-4149(03)00075-9